Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, h(y)) → h(f(f(h(a), y), x))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, h(y)) → h(f(f(h(a), y), x))
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
F(x, h(y)) → F(h(a), y)
F(x, h(y)) → F(f(h(a), y), x)
The TRS R consists of the following rules:
f(x, h(y)) → h(f(f(h(a), y), x))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
F(x, h(y)) → F(h(a), y)
F(x, h(y)) → F(f(h(a), y), x)
The TRS R consists of the following rules:
f(x, h(y)) → h(f(f(h(a), y), x))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.